Computing the Generalized Singular Value Decomposition

نویسندگان

  • Zhaojun Bai
  • James Demmel
چکیده

We present a variation of Paige's algorithm for computing the generalized singular value decomposition (GSVD) of two matrices A and B. There are two innovations. The rst is a new preprocessing step which reduces A and B to upper triangular forms satisfying certain rank conditions. The second is a new 2 by 2 triangular GSVD algorithm, which constitutes the inner loop of Paige's algorithm. We present proofs of stability and high accuracy of the 2 by 2 GSVD algorithm, and demonstrate it using examples on which all previous algorithms fail.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Face Recognition Based Rank Reduction SVD Approach

Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...

متن کامل

The Generalized Singular Value Decomposition and the Method of Particular Solutions

A powerful method for solving planar eigenvalue problems is the Method of Particular Solutions (MPS), which is also well known under the name “point matching method”. The implementation of this method usually depends on the solution of one of three types of linear algebra problems: singular value decomposition, generalized eigenvalue decomposition, or generalized singular value decomposition. W...

متن کامل

روش‌های تجزیه مقادیر منفرد منقطع و تیخونوف تعمیم‌یافته در پایدارسازی مسئله انتقال به سمت پائین

The methods applied to regularization of the ill-posed problems can be classified under “direct” and “indirect” methods. Practice has shown that the effects of different regularization techniques on an ill-posed problem are not the same, and as such each ill-posed problem requires its own investigation in order to identify its most suitable regularization method. In the geoid computations witho...

متن کامل

Modified Laplace Decomposition Method for Singular IVPs in the second-Order Ordinary Differential Equations

  In this paper, we use modified Laplace decomposition method to solving initial value problems (IVP) of the second order ordinary differential equations. Theproposed method can be applied to linear and nonlinearproblems    

متن کامل

Generalized essential matrix: Properties of the singular value decomposition

When considering non-central imaging devices, the computation of the relative pose requires the estimation of the rotation and translation that transform the 3D lines from one coordinate system to the second. In most of the state-ofthe-art methods, this transformation is estimated by the computing a 6× 6 matrix, known as the Generalized Essential Matrix. To allow a better understanding of this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 14  شماره 

صفحات  -

تاریخ انتشار 1993